Random Arc Allocation and Applications
نویسندگان
چکیده
The paper considers a generalization of the well known random placement of balls into bins. Given n circular arcs of lengths 1, : : : ,n we study the maximum number of overlapping arcs on a circle if the starting points of the arcs are chosen randomly. We give almost exact tail bounds on the maximum overlap of the arcs. These tail bounds yield a characterization of the expected maximum overlap that is tight up to constant factors in the lower order terms. We illustrate the strength of our results by presenting new performance guarantees for several application: Minimizing rotational delays of disks, scheduling accesses to parallel disks and allocating memory to limit cache interference misses.
منابع مشابه
Random Arc Allocation and Applications to Disks, Drums and DRAMs
The paper considers a generalization of the well known random placement of balls into bins. Given n circular arcs of lengths αi, 0 i< n we study the maximum number of overlapping arcs on a circle if the starting points of the arcs are chosen randomly. We give bounds that are tight up to constant factors in the lower order terms using a technique that combines Chernoff bounds with random walks. ...
متن کاملBuffer allocation in regular dataflow networks: an approach based on coloring circular-arc graphs
In this paper we discuss a method to perform compile-time buffer allocation, allowing efficient buffer sharing among the arcs of a special form of dataflow graphs known as regular stream flow graphs commonly used in Digital Signal Processing applications. We relate the buffer sharing problem to that of finding independent sets in weighted circular arc graph. An important difference between the ...
متن کاملAn Approach Based on Coloring Circular-Arc Graphs
to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. Abstract In this paper we discuss a method to perform compile-time buuer allocation, allowing eecient buuer sharing among the arcs of a s...
متن کاملConcentration of the Stationary Distribution on General Random Directed Graphs
We consider a random model for directed graphs whereby an arc is placed from one vertex to another with a prescribed probability which may vary from arc to arc. Using perturbation bounds as well as Chernoff inequalities, we show that the stationary distribution of a Markov process on a random graph is concentrated near that of the “expected” process under mild conditions. These conditions invol...
متن کاملAn Overview on the Applications of Spatial Analyses in the Management and Allocation of Hemodialysis Services
Introduction: The prevalence of Chronic Kidney Disease (CKD) reached about 13.4% in 2016. Among available treatment methods, hemodialysis is the most common way used for the treatment of patients with End-Stage Renal Disease (ESRD), the last stage of CKD. On average, these patients refer to hemodialysis centers three times a week. The high patients referral rate indicates the importance of prop...
متن کامل